Adams' cobar construction revisited
نویسندگان
چکیده
We give a short and streamlined proof of the following statement recently proven by author M. Zeinalian: cobar construction dg coassociative coalgebra normalized singular chains on path-connected pointed space is naturally quasi-isomorphic as associative algebra to based loop space. This extends classical theorem F. Adams originally for simply connected spaces. Our relating functor left adjoint homotopy coherent nerve functor.
منابع مشابه
The Loop Group and the Cobar Construction
We prove that for any 1-reduced simplicial set X, Adams’ cobar construction ΩCX on the normalised chain complex of X is naturally a strong deformation retract of the normalised chains CGX on the Kan loop group GX. In order to prove this result, we extend the definition of the cobar construction and actually obtain the existence of such a strong deformation retract for all 0-reduced simplicial s...
متن کاملThe Cobar Construction: a Modern Perspective
These are lecture notes from a minicourse given at Louvain-laNeuve in May 2007. There is a high, but not perfect, correlation between the contents of these notes and the subjects covered in the minicourse. Note that since these are lecture notes and not an article, many proofs are not included, while those that are included are only sketches, which are particularly brief when the proofs have al...
متن کاملAdams’ Trees Revisited Correct and Efficient Implementation
We present a correct proof of Adams’ trees of bounded balance, which are used in Haskell to implement Data.Map and Data.Set. Our analysis includes the previously ignored join operation, and also guarantees trees with smaller depth than the original one. Because the Adams’ trees can be parametrized, we use benchmarking to find the best choice of parameters. Finally, a saving memory technique bas...
متن کاملIranian EFL Learners’ Motivation Construction: Integrative Motivation Revisited
Although Gardner and his associates’ work was most influential in the field of L2 motivation, from the early 1990s onwards, their work has been criticized for several reasons. Some researchers claimed that integrative and instrumental orientations were no longer able to convey the complexity of the L2 motivation construct. To examine this complexity, the present study attempted to investigate t...
متن کاملPatterson-Wiedemann construction revisited
In 1983, Patterson and Wiedemann constructed Boolean functions on n = 15 input variables having nonlinearity strictly greater than 2n−1−2 n−1 2 . Construction of Boolean functions on odd number of variables with such high nonlinearity was not known earlier and also till date no other construction method of such functions are known. We note that the PattersonWiedemann construction can be underst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Documenta Mathematica
سال: 2022
ISSN: ['1431-0635', '1431-0643']
DOI: https://doi.org/10.4171/dm/895